Computing the Harsanyi functionH(S) forn-person cooperative transferable utility normal form games
نویسندگان
چکیده
منابع مشابه
A Closed-Form Formula for the Fair Allocation of Gains in Cooperative N-Person Games
Abstract This paper provides a closed-form optimal solution to the multi-objective model of the fair allocation of gains obtained by cooperation among all players. The optimality of the proposed solution is first proved. Then, the properties of the proposed solution are investigated. At the end, a numerical example in inventory control environment is given to demonstrate the application and t...
متن کاملComputing Normal Form Perfect Equilibria for Extensive Two-person Games
This paper presents an algorithm for computing an equilibrium of an extensive two-person game with perfect recall. The method is computationally efficient by virtue of using the sequence form, whose size is proportional to the size of the game tree. The equilibrium is traced on a piecewise linear path in the sequence form strategy space from an arbitrary starting vector. If the starting vector ...
متن کاملThe procedural value for cooperative games with non-transferable utility
I adapt Raiffa's discrete bargaining solution in order to take the possibility of partial cooperation into account when there are more than two players. The approach is non-cooperative. I slightly modify the bargaining procedure proposed by Sjöström for supporting the Raiffa solution, exactly as Hart and MasColell introduced the possibility of partial cooperation in (a slight variation of) the ...
متن کاملThe Harsanyi set for cooperative TU-games
A cooperative game with transferable utilities, or simply a TU-game, describes a situation in which players can obtain certain payo®s by cooperation. A solution mapping for these games is a mapping which assigns to every game a set of payo® distributions over the players in the game. Well-known solution mappings are the Core and the Weber set. In this paper we consider the mapping assigning to ...
متن کاملTransferable Utility Planning Games
Connecting between standard AI planning constructs and a classical cooperative model of transferable-utility coalition games, we introduce the notion of transferable-utility (TU) planning games. The key representational property of these games is that coalitions are valued implicitly based on their ability to carry out efficient joint plans. On the side of the expressiveness, we show that exist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Behavior Research Methods, Instruments, & Computers
سال: 1989
ISSN: 0743-3808,1532-5970
DOI: 10.3758/bf03202885